Qué (quién) es sum type - definición

DATA STRUCTURE USED TO HOLD A VALUE THAT COULD TAKE ON SEVERAL DIFFERENT, BUT FIXED, TYPES

Variant record; United modes; Sum type; Either type; Variant type

Tagged union

In computer science, a tagged union, also called a variant, variant record, choice type, discriminated union, disjoint union, sum type or coproduct, is a data structure used to hold a value that could take on several different, but fixed, types. Only one of the types can be in use at any one time, and a tag field explicitly indicates which one is in use.

https://en.wikipedia.org/wiki/Tagged_union

zero-sum game

MATHEMATICAL REPRESENTATION OF A SITUATION IN WHICH EACH PARTICIPANT'S GAIN OR LOSS OF UTILITY IS EXACTLY BALANCED BY THE LOSSES OR GAINS OF THE UTILITY OF THE OTHER PARTICIPANTS

Non-zero-sum; Non-zero-sum games; Zero sum game; Zero sum gain; Zero-sum games; Non-zero-sum game; Zero Sum Game; Non-zero sum; Non-zero sum game; Constant sum game; Constant sum; Constant-sum; Fixed sum game; Conflict game; Non zero sum; Negative-sum game; Zero Sum; Zero-sum (Game theory); Zero-sum (game theory); Zero sum; Zero-Sum Game; Zero-sum cost; Negative-sum; Zero-sum; Zero-Sum game; Zero–sum game; Non–zero-sum game; Non–zero sum game; Win-lose deal; Lose-win deal; 0 sum game; Zero sum deal; Zero-Sum; Nonzero-Sum Game

If you refer to a situation as a zero-sum game, you mean that if one person gains an advantage from it, someone else involved must suffer an equivalent disadvantage.

They believe they're playing a zero-sum game, where both must compete for the same paltry resources.

N-SING

Gauss sum

SUM

Gauss sums; Gaussian sum

In algebraic number theory, a Gauss sum or Gaussian sum is a particular kind of finite sum of roots of unity, typically

https://en.wikipedia.org/wiki/Gauss_sum

Wikipedia

Tagged union

In computer science, a tagged union, also called a variant, variant record, choice type, discriminated union, disjoint union, sum type or coproduct, is a data structure used to hold a value that could take on several different, but fixed, types. Only one of the types can be in use at any one time, and a tag field explicitly indicates which one is in use. It can be thought of as a type that has several "cases", each of which should be handled correctly when that type is manipulated. This is critical in defining recursive datatypes, in which some component of a value may have the same type as the value itself, for example in defining a type for representing trees, where it is necessary to distinguish multi-node subtrees and leaves. Like ordinary unions, tagged unions can save storage by overlapping storage areas for each type, since only one is in use at a time.

https://en.wikipedia.org/wiki/Tagged union